منابع مشابه
Adapting polyhedral properties from facility to hub location problems
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the elds of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapac...
متن کاملThe multi-facility location-allocation problem with polyhedral barriers
In this paper we consider the problem of locating N new facilities with respect to M existing facilities in the plane and in the presence of polyhedral barriers. We assume that a barrier is a region where neither facility location nor traveling is permitted. For the resulting multi-dimensional mixed-integer optimization problem two different alternate location and allocation procedures are deve...
متن کاملFacility Location Problems: Approximation Algorithms and Polyhedral Results
Het onderzoek beschreven in dit proefschrift is mede gefinancierd door de Technische Uni-versiteit Delft (TUDelft) and China Scholarship Council (CSC) Acknowledgements I have had a wonderful time during the past four years as a PhD student at TU Delft. This has been one of the most significant periods in my life, and would not have been possible without the support of my colleagues and friends....
متن کاملFacility Location on Terrains
Given a terrain defined as a piecewise-linear function with n triangles, and m point sites on it, we would like to identify the location on the terrain that minimizes the maximum distance to the sites. The distance is measured as the length of the Euclidean shortest path along the terrain. To simplify the problem somewhat, we extend the terrain to (the surface of) a polyhedron. To compute the o...
متن کاملOn Fault-Tolerant Facility Location
We give a new LP-rounding 1.724-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Shmoys & Swamy. Our work applies a dependent-rounding technique in the domain of facility location. The analysis of our algorithm benefits from, and extends, methods developed for Uncapacitated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2003
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-003-2769-0